An improved error term for minimum H-decompositions of graphs
نویسندگان
چکیده
منابع مشابه
Minimum H-decompositions of graphs
Given graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. Let φH(n) be the smallest number φ such that any graph G of order n admits an H-decomposition with at most φ parts. Here we determine the asymptotic of φH(n) for any fixed graph H as n tends to infinity. Partially supported by the Nation...
متن کاملMinimum rainbow H-decompositions of graphs
Given graphs G and H, we consider the problem of decomposing a properly edge-colored graph G into few parts consisting of rainbow copies of H and single edges. We establish a close relation to the previously studied problem of minimum H-decompositions, where an edge coloring does not matter and one is merely interested in decomposing graphs into copies of H and single edges.
متن کاملMinimum Weight H-Decompositions of Graphs: The Bipartite Case
Given graphs G and H and a positive number b, a weighted (H, b)-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms an H-subgraph. We assign a weight of b to each H-subgraph in the decomposition and a weight of 1 to single edges. The total weight of the decomposition is the sum of the weights of all elements in the decomposition. Let φ(n,H...
متن کاملMinimum H-decompositions of graphs: Edge-critical case
For a given graph H let φH (n) be the maximum number of parts that are needed to partition the edge set of any graph on n vertices such that every member of the partition is either a single edge or it is isomorphic to H. Pikhurko and Sousa conjectured that φH (n) = ex(n,H) for χ(H) ≥ 3 and all sufficiently large n, where ex(n,H) denotes the maximum size of a graph on n vertices not containing H...
متن کاملh-graphs: A new representation for tree decompositions of graphs
In geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination planner based solver. In general decomposition and recombination steps can be completed only when other steps have already been completed. This fact naturally defines a hie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2014
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.03.001